Mixed Static/Dynamic Profiling for Dictionary Based Code Compression

نویسندگان

  • E. Netto
  • R. Azevedo
  • P. Centoducatte
  • G. Araujo
چکیده

Many compression techniques have been proposed to accommodate ever increasing software pieces into restricted memory area in embedded systems. Recently, these techniques have been shown to improve other important design constrains like energy and performance. This paper proposes a blended dictionary model based on static/dynamic profiling that lead to best trade-offs on compression, performance and energy savings. We also propose a new dictionary based code compression algorithm, independent of the cache organization and processor, to support our experiments. A mix of benchmarks from Mediabench and MiBench suites revels that compression ratios of 75% can be obtained while decreasing bus accesses to the cache by 31% for the Leon processor. These results approach simultaneously the best solutions of when using pure static or pure dynamic information based dictionaries techniques.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Dictionary-Based Data Compression for Level-1 Caches

Data cache compression is actively studied as a venue to make better use of onchip transistors, increase apparent capacity of caches, and hide the long memory latencies. While several techniques have been proposed for L2 compression, L1 compression is an elusive goal. This is due to L1’s sensitivity to latency and the inability to create compression schemes that are both fast and adaptable to p...

متن کامل

Parallel Parsing Algorithms for Static Dictionary Compression

ÐThe data compression based on dictionary techniques works by replacing phrases in the input string with indexes into some dictionary. The dictionary can be static or dynamic. In static dictionary compression, the dictionary contains a predetermined fixed set of entries. In dynamic dictionary compression, the dictionary changes its entries during compression. We present parallel algorithms for ...

متن کامل

Design Consideration for Multi-lingual Cascading Text Compressors

In this paper, we studied the cascading of LZ variants to Huffman coding for multilingual documents. Two models are proposed: the static model and the adaptive (dynamic) model. The static model makes use of the dictionary generated by the LZW algorithm in the Chinese dictionary based Huffman compression to achieve better performance. The dynamic model is an extension of the static cascading mod...

متن کامل

Development of a compression system dynamic simulation code for testing and designing of anti-surge control system

In recent years, several research activities have been conducted to develop knowledge in analysis, design and optimization of compressor anti-surge control system. Since the anti-surge control testing on a full-scale compressor is limited to possible consequences of failure, and also the experimental facility can be expensive to set up control strategies and logic, design process often involves...

متن کامل

A Post-Processing Mechanism for Sequential Use of Static and Dynamic Enumerative Code

A bijection between a complete set of source words and a complete set of codewords defines a variable-to-variable length (VV) source code. Such code is used to parse sequentially a source sequence into codewords. In a naive parsing of a finite source sequence, the last incomplete source word requires a separate post-processing. However, if the sizes of the source and the code alphabet are the s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003